#计算n！
def solve_n(n):
    if n == 1:
        return n
    return solve_n(n-1)*n
#哈哈哈 自创的顶级递归
def solve_n_i(i, n):
    if i == n:
        return n
    return solve_n_i(i + 1, n)*i    

if __name__ == "__main__":
    print(solve_n(3))
    print(solve_n_i(1,3))